Many-to-Many Disjoint Path Covers in Double Loop Networks
نویسنده
چکیده
منابع مشابه
Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks
An unpaired many-to-many -disjoint path cover (-DPC) of a graph is a set of disjoint paths joining distinct sources and sinks in which each vertex of is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every -d...
متن کاملPaired Many-to-Many Disjoint Path Covers in Recursive Circulants and Tori
A paired many-to-many -disjoint path cover (paired -DPC) of a graph is a set of disjoint paths joining distinct source-sink pairs in which each vertex of is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants with ≥ and tori, and show that provided the number of faulty elements (vertices and/or edges) is or less, every nonbiparti...
متن کاملOre-type degree conditions for disjoint path covers in simple graphs
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex subsets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. It is classified as paired if each source in S is required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we develop Ore-type sufficient conditions for the ...
متن کاملGeneral-demand disjoint path covers in a graph with faulty elements
A k-disjoint path cover of a graph is a set of k internally vertex-disjoint paths which cover the vertex set with k paths and each of which runs between a source and a sink. Given that each source and sink v is associated with an integer-valued demand d(v) ≥ 1, we are concerned with general-demand k-disjoint path cover in which every source and sink v is contained in the d(v) paths. In this pap...
متن کاملMany-to-many two-disjoint path covers in cylindrical and toroidal grids
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...
متن کامل